Optimal Online Bin Packing Algorithms for Some Cases with Two Item Sizes

نویسندگان

چکیده

The bin packing problem is a of finding an assignment sequence items to minimum number bins, each capacity one. An online algorithm for the that irrevocably assigns item one by from head sequence. Gutin, Jensen, and Yeo (2006) considered version in which all are only two different sizes knows possible advance, gave optimal case when larger size exceeds 1/2. In this paper we provide some cases at most 1/2, on basis framework facilitates design analysis algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

More on online bin packing with two item sizes

We follow the work of [7] and study the online bin packing problem, where every item has one of two possible sizes which are known in advance. We focus on the parametric case, where both item sizes are bounded from above by 1 k for some natural number k ≥ 1. We show that for every possible pair of item sizes, there is an algorithm with competitive ratio of at most (k+1) 2 k2+k+1 . We prove that...

متن کامل

Optimal On-Line Bin Packing with Two Item Sizes

The problem of on-line bin packing restricted to instances with only two item sizes (known in advance) has a well-known lower bound of 4/3 for its asymptotic competitive ratio. We present an algorithm which shows that this lower bound is also an upper bound. Hence the asymptotic competitive ratio for this on-line problem is equal to 4/3. Our result extends the corresponding result of Faigle, Ke...

متن کامل

Bin packing with divisible item sizes

We study a variety of NP-hard bin packing problems under a divisibility constraint that generalizes the often encountered situation in which all item sizes are powers of 2. For ordinary one-dimensional bin packing, we show that First Fit Decreasing produces optimal packings under this restriction, and that if in addition the largest item size divides the bin capacity, then even the less powerfu...

متن کامل

Bin packing with controllable item sizes

We consider a natural resource allocation problem in which we are given a set of items, where each item has a list of pairs associated with it. Each pair is a configuration of an allowed size for this item, together with a nonnegative penalty, and an item can be packed using any configuration in its list. The goal is to select a configuration for each item so that the number of unit bins needed...

متن کامل

On-line bin Packing with Two Item Sizes

We study the on-line bin packing problem (BPP). In BPP, we are given a sequence B of items a1, a2, . . . , an and a sequence of their sizes (s1, s2, . . . , sn) (each size si ∈ (0, 1]) and are required to pack the items into a minimum number of unit-capacity bins. Let R∞ {α,β} be the minimal asymptotic competitive ratio of an on-line algorithm in the case when all items are only of two differen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

سال: 2023

ISSN: ['1745-1337', '0916-8508']

DOI: https://doi.org/10.1587/transfun.2022dmp0008